Additive approximation for edge-deletion problems
نویسندگان
چکیده
منابع مشابه
On Bayesian Network Approximation by Edge Deletion
We consider the problem of deleting edges from a Bayesian network for the purpose of simplifying models in probabilistic inference. In particular, we propose a new method for deleting network edges, which is based on the evidence at hand. We provide some interesting bounds on the KL-divergence between original and approximate networks, which highlight the impact of given evidence on the quality...
متن کاملApproximation hardness of edge dominating set problems
We provide the first interesting explicit lower bounds on efficient approximability for two closely related optimization problems in graphs, Minimum Edge Dominating Set and Minimum Maximal Matching. We show that it is NP-hard to approximate the solution of both problems to within any constant factor smaller than 7 6 . The result extends with negligible loss to bounded degree graphs and to every...
متن کاملA Unified Approximation Algorithm for Node-deletion Problems
In this paper we consider a unified (polynomial time) approximation method for node-deletion problems with nontrivial and hereditary graph properties. One generic algorithm scheme is presented, which can be applied to any node-deletion problem for finding approximate solutions. It will be shown then that the quality of solutions found by this algorithm is determined by the quality of any minima...
متن کاملPolylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems
Let F be a family of graphs. A canonical vertex deletion problem corresponding to F is defined as follows: given an n-vertex undirected graph G and a weight function w : V (G)→ R, find a minimum weight subset S ⊆ V (G) such that G− S belongs to F . This is known as Weighted F Vertex Deletion problem. In this paper we devise a recursive scheme to obtain O(logO(1) n)-approximation algorithms for ...
متن کاملApproximation Algorithms for Edge Partitioned Vertex Cover Problems
We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = (V,E), a cost function c : V → Z, a partition P1, . . . , Pr of the edge set E, and a parameter ki for each partition Pi. The goal is to find a minimum cost set of vertices which cover at least ki edges from the partition Pi. We call this the Partition-VC problem. In this paper, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics
سال: 2009
ISSN: 0003-486X
DOI: 10.4007/annals.2009.170.371